Routing algorithms

Results: 695



#Item
41Optimal Top-K Query Evaluation for Weighted Business Processes Daniel Deutch Tel Aviv University  Tova Milo

Optimal Top-K Query Evaluation for Weighted Business Processes Daniel Deutch Tel Aviv University Tova Milo

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2010-09-20 08:07:02
42Exploring Unknown Environments with Obstacles Susanne Albers Klaus Kursawey  Sven Schuiererz

Exploring Unknown Environments with Obstacles Susanne Albers Klaus Kursawey Sven Schuiererz

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:05:22
43Algorithms for the Price of Optimum in Stackelberg Games (2006; Kaporis, Spirakis) Alexis C. Kaporis, Department of Computer Engineering and Informatics, University of Patras http://students.ceid.upatras.gr/˜kaporis Pau

Algorithms for the Price of Optimum in Stackelberg Games (2006; Kaporis, Spirakis) Alexis C. Kaporis, Department of Computer Engineering and Informatics, University of Patras http://students.ceid.upatras.gr/˜kaporis Pau

Add to Reading List

Source URL: students.ceid.upatras.gr

Language: English - Date: 2007-02-22 11:45:18
44Delta: Scalable Data Dissemination under Capacity ∗ Constraints Konstantinos Karanasos  Asterios Katsifodimos

Delta: Scalable Data Dissemination under Capacity ∗ Constraints Konstantinos Karanasos Asterios Katsifodimos

Add to Reading List

Source URL: www.user.tu-berlin.de

Language: English - Date: 2016-07-21 07:25:50
45Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] †

Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] †

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:12
46Optimal on-line colorings for minimizing the number of ADMs in optical networks⋆ Mordechai Shalom1,3 , Prudence W.H. Wong2 , and Shmuel Zaks1 ⋆⋆

Optimal on-line colorings for minimizing the number of ADMs in optical networks⋆ Mordechai Shalom1,3 , Prudence W.H. Wong2 , and Shmuel Zaks1 ⋆⋆

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2009-02-24 10:13:31
47ISSN No: International Journal & Magazine of Engineering, Technology, Management and Research A Peer Reviewed Open Access International Journal

ISSN No: International Journal & Magazine of Engineering, Technology, Management and Research A Peer Reviewed Open Access International Journal

Add to Reading List

Source URL: www.ijmetmr.com

Language: English - Date: 2015-01-27 07:14:54
48Subjective-Cost Policy Routing ⋆ Joan Feigenbaum a,1 a Yale University Computer Science Department, 51 Prospect St., New Haven, CT 06511, USA.

Subjective-Cost Policy Routing ⋆ Joan Feigenbaum a,1 a Yale University Computer Science Department, 51 Prospect St., New Haven, CT 06511, USA.

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2008-02-16 15:53:17
49ENC GNSSRotterdam guidance and navigation algorithms can be integrated in order to develop applications with particular requirements. Navigation of physicallychallenged people is one example where the database mu

ENC GNSSRotterdam guidance and navigation algorithms can be integrated in order to develop applications with particular requirements. Navigation of physicallychallenged people is one example where the database mu

Add to Reading List

Source URL: quentin.ladetto.ch

Language: English - Date: 2007-02-12 05:28:23
50Tight Bounds for Delay-Sensitive Aggregation Yvonne Anne Oswald Stefan Schmid  Roger Wattenhofer

Tight Bounds for Delay-Sensitive Aggregation Yvonne Anne Oswald Stefan Schmid Roger Wattenhofer

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:31